Generating Recurrent Patterns Using Clique Algorithm

نویسنده

  • Bipin Nair
چکیده

Generating Recurrent Patterns Using Clique Algorithm Bipin Nair B J Lecturer in Department of Computer Science Amrita Vishwa Vidyapeetham, Mysore Campus, Karnataka, INDIA _________________________________________________________________________________________ Abstract: Clustering is one of the several machine learning techniques to find out frequent patterns. Most of the clustering methods are not designed for high dimensional data. As the dimensions increase, cluster formation becomes a major challenge in data mining. As a solution to this problem, an algorithm called clique is introduced. Clique is a clustering algorithm which helps to find frequent patterns from high dimensional data. In many real world applications, this clustering technique is being used. This report will look into the sales application, where we can find frequent patterns in product sales. This algorithm can be regarded as one of the ways to improve sales.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

O-30: Comparing Expression Patterns of Endometrial Genes in Implantation Failures and Recurrent Miscarriages with Fertile Couples Following ICSI/IVF Using in Silico Analysis

Background: To screen and diagnose patients with recurrent abortions and implantation failure after IVF/ICSI, differentially expressed genes of endometrium through DNA microarrays were monitored. Materials and Methods: Microarray expression profile of GSE26787 dataset from GEO database was used to analyze gene expression profiles of 15 endometrial biopsy samples- five from control fertile (CF) ...

متن کامل

Solving the maximum clique problem using a tabu search approach

We describe two variants of a tabu search heuristic, a deterministic one and a probabilistic one, for the maximum clique problem. This heuristic may be viewed as a natural alternative implementation of tabu search for this problem when compared to existing ones. We also present a new random graph generator, the/S-generator, which produces graphs with larger clique sizes than comparable ones obt...

متن کامل

Polynomial-Time Solvability of the Maximum Clique Problem

The maximum clique problem is known to be a typical NP-complete problem, and hence it is believed to be impossible to solve it in polynomial-time. So, it is important to know a reasonable sufficient condition under which the maximum clique problem can be proved to be polynomial-time solvable. In this paper, given a graph of vertices and whose maximum degree is , we prove that if is less than or...

متن کامل

Multi-Clique-Width

Multi-clique-width is obtained by a simple modification in the definition of cliquewidth. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width. Efficient algorithms based on multi-clique-width are still possible for interesting tasks like computing the independent set polynomial or testing c-colorabili...

متن کامل

Implementation issues of clique enumeration algorithm

A clique is a subgraph in which any two vertices are connected. Clique represents a densely connected structure in the graph, thus used to capture the local related elements such as clustering, frequent patterns, community mining, and so on. In these applications, enumeration of cliques rather than optimization is frequently used. Recent applications have large scale very sparse graphs, thus ef...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015